Numerical Solution of Linear - Quadratic Control

نویسندگان

  • Peter Benner
  • Volker Mehrmann
  • Hongguo Xu
چکیده

We discuss the numerical solution of linear quadratic optimal control problems for descriptor systems. The classical solution approach for these problems requires the computation of deeating subspaces of structured pencils. We extend the recently developed methods 6] for Hamiltonian matrices to the general case of embedded pencils as they arise in descriptor systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the Best Coefficients in the Objective Function of a Linear Quadratic Control Problem

Finding the best weights of the state variables and the control variables in the objective function of a linear-quadratic control problem is considered. The weights of these variables are considered as two diagonal matrices with appropriate size and so the objective function of the control problem becomes a function of the diagonal elements of these matrices. The optimization problem which is d...

متن کامل

Haar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems

‎In this paper‎, ‎Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems‎. ‎Firstly‎, ‎using necessary conditions for optimality‎, ‎the problem is changed into a two-boundary value problem (TBVP)‎. ‎Next‎, ‎Haar wavelets are applied for converting the TBVP‎, ‎as a system of differential equations‎, ‎in to a system of matrix algebraic equations‎...

متن کامل

Numerical Methods for Large Scale Moving Horizon Estimation and Control

Abstract: Both the linear moving horizon estimator and controller may be solved by solving a linear quadratic optimal control problem. A primal active set, a dual active set, and an interior point algorithm for solution of the linear quadratic optimal control problem are presented. The major computational effort in all these algorithms reduces to solution of certain unconstrained linear quadrat...

متن کامل

About One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions

In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...

متن کامل

A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007